A maximal multiple coverage and network restoration problem for disaster recovery

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sensor Network Coverage Restoration

Wireless sensor networks are emerging as a new computational platform consisting of small, low-power and inexpensive nodes used in a broad set of application areas including environmental monitoring, habitat monitoring and disaster recovery. Typically sensor nodes are deployed over a geographical area for the purpose of detecting, tracking and monitoring events of interest. Since sensor nodes a...

متن کامل

A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network

Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...

متن کامل

Towards a business continuity information network for rapid disaster recovery

Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities such as the terrorist attacks of September 11 2001 and hurricanes/earthquakes i.e. Katrina (2005), Wilma (2005) and Indian Ocean Tsunami (2004). Most of the recent work has been conducted for crisis management under terrorist attacks and emergency management services ...

متن کامل

A Linear Kernel for the Complementary Maximal Strip Recovery Problem

In this paper, we compute the first linear kernel for the complementary problem of Maximal Strip Recovery (CMSR) — a well-known NP-complete problem in computational genomics. Let k be the parameter which represents the size of the solution. The core of the technique is to first obtain a tight 18k bound on the parameterized solution search space, which is done through a mixed global rules and lo...

متن کامل

Maximal Benefit Location Problem for A Congested System

Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Perspectives

سال: 2020

ISSN: 2214-7160

DOI: 10.1016/j.orp.2019.100132